On Convolutional Lattice Codes and Lattice Decoding Using Trellis Structure

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Decoding of Lattice Codes

We consider lattice tree-codes based on a latt ice A having a finite trellis diagram T . Such codes are easy to encode and benefit f rom the structure of A. Sequential decoding of lattice tree-codes is studied, and the corresponding Fano metric is derived. A n upper bound on the running time of the sequential decoding algorithm is established, and found to resemble the Pareto distribution. O u ...

متن کامل

Variable-complexity trellis decoding of binary convolutional codes

We consider trellis decoding of convolutional codes with selectable effort, as measured by decoder complexity. Decoding is described for single parent codes with a variety of complexities, with performance “near” that of the optimal fixed receiver complexity coding system. Effective free distance is examined. Criteria are proposed for ranking parent codes, and some codes found to be best accord...

متن کامل

Codes from lattice and related graphs, and permutation decoding

Codes of length n and dimension 2n− 1 or 2n− 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its line graph, the lattice graph, are examined. The parameters of the codes for all primes are obtained and PD-sets are found for full permutation decoding for all integers n ≥ 3.

متن کامل

1-State Error-Trellis Decoding of LDPC Convolutional Codes Based on Circulant Matrices

We consider the decoding of convolutional codes using an error trellis constructed based on a submatrix of a given check matrix. In the proposed method, the syndromesubsequence computed using the remaining submatrix is utilized as auxiliary information for decoding. Then the ML error path is correctly decoded using the degenerate error trellis. We also show that the decoding complexity of the p...

متن کامل

Binary codes from rectangular lattice graphs and permutation decoding

We examine the binary codes obtained from the row span over the field F2 of an adjacency matrix of the rectangular lattice graphs L2(m,n) for 3 ≤ m < n and show that permutation decoding can be used for full error-correction for these codes by finding explicit information sets and PD-sets for these information sets.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2016

ISSN: 2169-3536

DOI: 10.1109/access.2016.2632038